Recursively Divided Pancake Graphs with a Small Network Cost

Graphs are often used as models to solve problems in computer science, mathematics, and biology. A pancake sorting problem is modeled using a graph whose classes include burnt graphs, signed permutation restricted graphs. The network cost degree × diameter. Finding with small like finding good algorithm. We propose novel recursively divided (RDP) that has smaller than other pancake-like In the Pn, number of nodes n!, n − 1, O(n2). an RDPn, 2log2n O(n(log2n)3). Because O(n(log2n)3) < O(n2), RDP superior this paper, we RDPn analyze its basic topological properties. Second, show recursive symmetric. Third, algorithm proposed, diameter derived. Finally, compared between